Local distance constrained bribery in voting
نویسندگان
چکیده
منابع مشابه
Frugal Bribery in Voting
Bribery in elections is an important problem in computational social choice theory. We introduce and study two important special cases of the classical $BRIBERY problem, namely, FRUGAL-BRIBERY and FRUGAL-$BRIBERY where the briber is frugal in nature. By this, we mean that the briber is only able to influence voters who benefit from the suggestion of the briber. More formally, a voter is vulnera...
متن کاملBribery in Voting With Soft Constraints
We consider a multi-agent scenario where a collection of agents needs to select a common decision from a large set of decisions over which they express their preferences. This decision set has a combinatorial structure, that is, each decision is an element of the Cartesian product of the domains of some variables. Agents express their preferences over the decisions via soft constraints. We cons...
متن کاملBribery in Voting Over Combinatorial Domains Is Easy
We investigate the computational complexity of finding optimal bribery schemes in voting domains where the candidate set is the Cartesian product of a set of variables and agents’ preferences are represented as CP-nets. We show that, in most cases, the bribery problem is easy. This also holds for some cases of k-approval, where bribery is difficult in traditional domains.
متن کاملLlull and Copeland Voting Broadly Resist Bribery and Control
Control of elections refers to attempts by an agent to, via such actions as addition/deletion/partition of candidates or voters, ensure that a given candidate wins [BTT92]. An election system in which such an agent’s computational task is NP-hard is said to be resistant to the given type of control. The only election systems known to be resistant to all the standard control types are highly art...
متن کاملLlull and Copeland Voting Computationally Resist Bribery and Control
Control and bribery are settings in which an external agent seeks to influence the outcome of an election. Constructive control of elections refers to attempts by an agent to, via such actions as addition/deletion/partition of candidates or voters, ensure that a given candidate wins [BTT92]. Destructive control refers to attempts by an agent to, via the same actions, preclude a given candidate’...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2021
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.10.005